Enumeration of finite field labels on graphs
نویسندگان
چکیده
منابع مشابه
On Laplacian energy of non-commuting graphs of finite groups
Let $G$ be a finite non-abelian group with center $Z(G)$. The non-commuting graph of $G$ is a simple undirected graph whose vertex set is $Gsetminus Z(G)$ and two vertices $x$ and $y$ are adjacent if and only if $xy ne yx$. In this paper, we compute Laplacian energy of the non-commuting graphs of some classes of finite non-abelian groups..
متن کاملOn the Graphs Related to Green Relations of Finite Semigroups
In this paper we develop an analog of the notion of the con- jugacy graph of nite groups for the nite semigroups by considering the Green relations of a nite semigroup. More precisely, by de ning the new graphs $Gamma_{L}(S)$, $Gamma_{H}(S)$, $Gamma_{J}(S)$ and $Gamma_{D}(S)$ (we name them the Green graphs) related to the Green relations L R J H and D of a nite semigroup S , we first atte...
متن کاملOn the Enumeration of Inscribable Graphs
| We explore the question of counting, and estimating the number and the fraction of, in-scribable graphs. In particular we will concern ourselves with the number of inscribable and circum-scribable maximal planar graphs (synonym: simplicial polyhedra) on V vertices, or, dually, the number of circumscribable and inscribable trivalent (synonyms: 3-regular, simple) polyhedra. For small V we provi...
متن کاملOn the Enumeration of Interval Graphs
We present upper and lower bounds for the number in of interval graphs on n vertices. Answering a question posed by Hanlon, we show that the ordinary generating function I(x) = ∑ n≥0 in x n for the number in of n-vertex interval graphs has radius of convergence zero. We also show that the exponential generating function J(x) = ∑ n≥0 in x n/n! has radius of convergence at least 1/2.
متن کاملOn the enumeration of certain weighted graphs
We enumerate weighted graphs with a certain upper bound condition. We also compute the generating function of the numbers of these graphs, and prove that it is a rational function. In particular, we show that if the given graph is a bipartite graph, then its generating function is of the form p(x) (1−x)m+1 , where m is the number of vertices of the graph and p(x) is a polynomial of degree at mo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1997
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(96)00296-8